A Method for Path Coverage Testing Based on Deterministic Finite Automata Machine 基于有穷自动机的路径覆盖测试方法
The biggest obstacle to deterministic behaviour of a Java application is the way memory management is handled by the Java virtual machine ( JVM). 对Java应用程序来说,确定性行为的最大障碍是由Java虚拟机(JVM)托管的内存管理方式。
It is proved that the SEE 'satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine. 通过给出具体的确定型图林机,证明了SBE的可满足性(SAT)问题在多项式时间内可解。
The deterministic problem of minimizing total weighted deviations of job completion times from a common due date on a single machine ( abbreviated to TWD problem) is a typical scheduling model in Just-In-Time production environment. The general TWD problem is NP-hard. 完工时间与交货期偏差加权和最小化单机调度(简记TWD)问题是Just-In-Time生产环境下典型的调度模型,是NP-hard问题。
Also, the deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version. 指出确定性环境下的最小化误工任务数单机调度问题是模糊情况的特例。